Solving stochastic multiobjective vehicle routing problem using probabilistic metaheuristic
نویسندگان
چکیده
منابع مشابه
A hybrid metaheuristic to solve the vehicle routing problem with stochastic demand and probabilistic duration constraints
The vehicle routing problem with stochastic demands and probabilistic distance constraints (VRPSD-PDC) can be defined on a complete and undirected graph G = (V, E), where V = {0, . . . , n} is the vertex set and E = {(v, u) : v, u ∈ V, v ̸= u} is the edge set. Vertices v = 1, . . . , n represent the customers and vertex v = 0 represents the depot. A distance de is associated with edge e = (v, u)...
متن کاملSolving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic
This paper presents two GRASP metaheuristic algorithms for the vehicle routing problem, considering the capacity and shared demand of the customers. In this paper the solution obtained is compared with a greedy solution and two hybrid solutions (greedy and random). The results obtained show that the GRASP algorithm obtains a better quality solution for this kind of problem.
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملThe Stochastic Vehicle Routing Problem
1. Summary 2 1.1 Uncertainty of input parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Availability of input parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Commodity handling patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Classification of methods . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201710500001